Deleting Powers in Words
نویسنده
چکیده
We consider the language consisting of all words such that it is possible to obtain the empty word by iteratively deleting powers. It turns out that in the case of deleting squares in binary words this language is regular, and in the case of deleting squares in words over a larger alphabet the language is not regular. However, for deleting squares over any alphabet we find that this language can be generated by a linear index grammar which is a mildly context sensitive grammar formalism. In the general case we show that this language is generated by an indexed grammar.
منابع مشابه
On Sums of Powers of Inverse Complete Quotients
For an irrational number x, let xn denote its n-th continued fraction inverse complete quotient, obtained by deleting the first n partial quotients. For any positive real number r, we establish the optimal linear bound on the sum of the r-th powers of the first n complete quotients. That is, we find the smallest constants α(r),β(r) such that x1 + . . . + x r n < α(r)n + β(r) for all n ≥ 1 and a...
متن کاملAnti-Powers in Infinite Words
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order k. In this paper we take a different point of view and define an anti-power of order k as a concatenation of k consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existen...
متن کاملFinite Automata, Palindromes, Powers, and Patterns
Given a language L and a nondeterministic finite automaton M , we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given thatM accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the nonpalindromes, the k-powers, the non-k-powers, the...
متن کاملPowers in a class of A-strict standard episturmian words
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 21 شماره
صفحات -
تاریخ انتشار 2017